Linking rings structures and semisymmetric graphs: Cayley constructions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semisymmetric Cubic Graphs Constructed from Bi-Cayley Graphs of An

For a group T and a subset S of T , the bi-Cayley graph BCay(T, S) of T with respect to S is the bipartite graph with vertex set T×{0, 1} and edge set {{(g, 0), (sg, 1)} | g ∈ T, s ∈ S}. In this paper, we investigate cubic bi-Cayley graphs of finite nonabelian simple groups. We give several sufficient or necessary conditions for a bi-Cayley graph to be semisymmetric, and construct several infin...

متن کامل

Lifting constructions of strongly regular Cayley graphs

Article history: Received 21 December 2012 Received in revised form 11 November 2013 Accepted 14 November 2013 Available online 12 December 2013 Communicated by Igor Shparlinski

متن کامل

New Constructions of Self-Complementary Cayley Graphs

Self-complementary Cayley graphs are useful in the study of Ramsey numbers, but they are relatively very rare and hard to construct. In this paper, we construct several families of new self-complementary Cayley graphs of order p4 where p is a prime and congruent to 1 modulo 8.

متن کامل

Unitary Cayley Graphs for Finite Rings

Given an integer n, one defines the unitary Cayley graph, denoted Cay(Zn,Zn), to be the graph whose vertex set is Zn, the integers modulo n, with an edge between two vertices x, y if x− y is a unit in (the ring) Zn. Unitary Cayley graphs have been studied as objects of independent interest (see, for example, [3], [2], [7], [8], [9]) but are of particular relevance in the study of graph represen...

متن کامل

Semisymmetric graphs from polytopes

Every finite, self-dual, regular (or chiral) 4-polytope of type {3, q, 3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which are edgebut not vertex-transitive). In particular, the Gray graph arises as the medial layer graph of a certain universal locally toroidal regular 4-polytope.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2016

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2015.05.004